class Solution {
public:
    int searchInsert(vector<int>& nums, int target) {
        int left=0,right=nums.size()-1,ans=-1;


        while(left<=right)
        {
            int mid=left+(right-left)/2;
            if(nums[mid]>target)
            {
                right=mid-1;
            }
            else if(nums[mid]==target)
            {
                ans=mid;
                break;
            }
            else
            {
                left=mid+1;
            }
        }
        if(ans==-1)
        {
            return left;
        }
        return ans;
    }
};